PraisefortheFirstEdition“...complete,up-to-datecoverageofcomputationalcomplexitytheory...thebookpromisestobecomethestandardreferenceoncomputationalcomplexity.“-ZentralblattMATHAthoroughrevisionbasedonadvancesinthefieldofcomputationalcomplexityandreaders’feedback,theSecondEditionofTheoryofComputationalComplexitypresentsupdatestotheprinciplesandapplicationsessentialtounderstandingmoderncomputationalcomplexitytheory.Theneweditioncontinuestoserveasacomprehensiveresourceontheuseofsoftwareandcomputationalapproachesforsolvingalgorithmicproblemsandtherelateddifficultiesthatcanbeencountered.Maintainingextensiveanddetailedcoverage,TheoryofComputationalComplexity,SecondEdition,examinesthetheoryandmethodsbehindcomplexitytheory,suchascomputationalmodels,decisiontreecomplexity,circuitcomplexity,andprobabilisticcomplexity.TheSecondEditionalsofeaturesrecentdevelopmentsonareassuchasNP-completenesstheory,aswellas:●AnewcombinatorialproofofthePCPtheorembasedonthenotionofexpandergraphs,aresearchareainthefieldofcomputerscience●Additionalexercisesatvaryinglevelsofdifficultytofurthertestcomprehensionofthepresentedmaterial●End-of-chapterliteraturereviewsthatsummarizeeachtopicandofferadditionalsourcesforfurtherstudyTheoryofComputationalComplexity,SecondEdition,isanexcellenttextbookforcoursesoncomputationaltheoryandcomplexityatthegraduatelevel.Thebookisalsoausefulreferenceforpractitionersinthefieldsofcomputerscience,engineering,andmathematicswhoutilizestate-of-the-artsoftwareandcomputationalmethodstoconductresearch.
THEORY engineering FEEDBACK END COMPUTATIONAL COMPLETE ASWELLAS
